Acta Polytechnica

نویسندگان

  • Masoumeh Mansouri
  • Henrik Andreasson
  • Federico Pecora
چکیده

Fleet automation often involves solving several strongly correlated sub-problems, including task allocation, motion planning, and coordination. Solutions need to account for very specific, domaindependent constraints. In addition, several aspects of the overall fleet management problem become known only online. We propose a method for solving the fleet-management problem grounded on a heuristically-guided search in the space of mutually feasible solutions to sub-problems. We focus on a mining application which requires online contingency handling and accommodating many domainspecific constraints. As contingencies occur, efficient reasoning is performed to adjust the plan online for the entire fleet.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Acta Polytechnica

We show that, contrary to a claim made in arXiv:1011.0645, the von Neumann-Winger bound states that lie in the continuum of the scattering states are fundamentally different from Naimark’s spectral singularities.

متن کامل

Acta Polytechnica

Jan/Feb, 2016. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 Acta Polytechnica 00(0):1–8, 0000 © Czech Technical University in Prague, 2015 PREPRINT 2015-09-24 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 9...

متن کامل

Acta Polytechnica

The aim of this paper is to make an explicit link between the Weyl-orbit functions and the corresponding polynomials, on the one hand, and to several other families of special functions and orthogonal polynomials on the other. The cornerstone is the connection that is made between the one-variable orbit functions of A1 and the four kinds of Chebyshev polynomials. It is shown that there exists a...

متن کامل

Polytechnica Scandinavica

........................................................................................................................................ 2 PREFACE............................................................................................................................................ 3 CONTENTS.......................................................................................................

متن کامل

Acta Polytechnica Scandinavica Mathematics, Computing and Management in Engineering Series No. 82 Data Exploration Using Self-organizing Maps Data Exploration Using Self-organizing Maps. Acta Polytechnica

Finding structures in vast multidimensional data sets be they measurement data statistics or textual documents is di cult and time consuming Interesting novel relations between the data items may be hidden in the data The self organizing map SOM algorithm of Kohonen can be used to aid the exploration the structures in the data sets can be illustrated on special map displays In this work the met...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016